forbidding subgraph meaning in Chinese

禁用子图

These questions are special cases of the so called forbidden subgraph problem .
这些问题都是所谓禁用子图问题的特殊情形。
The forbidden subgraph problem is a prime example of the rather large family of extremal problems is graph theory .
禁向子图问题是图论中相当大的一类极值问题中的主要例子。
But usually it is difficult to work out the hamilton problem of any graph , then we turn to explore the graphs containing forbidden subgraph , for example , claw - free graph , almost claw - free graph , quasi claw - free graph
由于直接研究任一图类的hamilton问题往往比较困难，于是人们转而研究含有某些禁用子图的图类，如：无爪图，几乎无爪图，拟无爪图等